Capacity of Block-Memoryless Channels with Causal Channel Side Information
نویسندگان
چکیده
The capacity of a time-varying block-memoryless channel in which the transmitter and the receiver have access to (possibly different) noisy causal channel side information (CSI) is obtained. It is shown that the capacity formula obtained in this correspondence reduces to the capacity formula reported in [1] for the special case where the transmitter CSI is a deterministic function of the receiver CSI.
منابع مشابه
Gaussian Z Channel with Intersymbol Interference
In this paper, we derive a capacity inner bound for a synchronous Gaussian Z channel with intersymbol interference (ISI) under input power constraints. This is done by converting the original channel model into an n-block memoryless circular Gaussian Z channel (n-CGZC) and successively decomposing the n-block memoryless channel into a series of independent parallel channels in the frequency dom...
متن کاملComputation of the Capacity for Discrete Memoryless Channels and Sum Capacity of Multiple Access Channels with Causal Side Information at Receiver
Capacity analysis and computation for communication channels with side information at the receiver is an important area of research. Cover-Chiang have proved the increment of capacity with non-causal information at the receiver. We investigate this capacity increment for the channel with causal side information and proposed an efficient algorithm for computing the capacity of discrete memoryles...
متن کاملSome New Results on the Wiretap Channel with Side Information
In this paper, the model of wiretap channel has been reconsidered for the case that the main channel is controlled by channel state information (side information), and it is available at the transmitter in a noncausal manner (termed here noncausal side information) or causal manner (termed here causal side information). Inner and outer bounds are derived on the capacity-equivocation regions for...
متن کاملPolarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملCapacity Bounds and a Certain Capacity Region for Special Three-Receiver Broadcast Channels with Side Information
The fact that the results for 2-receiver broadcast channels (BCs) are not generalized to the 3-receiver ones is of information theoretical importance. In this paper we study two classes of discrete memoryless BCs with non-causal side information (SI), i.e. multilevel BC (MBC) and 3-receiver less noisy BC. First, we obtain an achievable rate region and a capacity outer bound for the MBC. Second,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0806.1062 شماره
صفحات -
تاریخ انتشار 2008